FIRST ORDER DYNAMIC LOGIC WITH DECIDABLE PROOFS AND WORKABLE MODEL THEORYSAIN I.1981; LECT. NOTES COMPUT. SCI.; ISSN 0302-9743; DEU; DA. 1981; NO 117; PP. 334-340; BIBL. 7 REF.Conference Paper

Temporal logics need their clocksSAIN, I.Theoretical computer science. 1992, Vol 95, Num 1, pp 75-95, issn 0304-3975Article

A simple proof for the completeness of Floyd's methodSAIN, I.Theoretical computer science. 1985, Vol 35, Num 2-3, pp 345-348, issn 0304-3975Article

COMPLETENESS PROBLEMS IN VERIFICATION OF PROGRAMS AND PROGRAM SCHEMESANDREXA H; NEMETT I; SAIN I et al.1979; LECTURE NOTES COMPUTER SCI.; DEU; DA. 1979; VOL. 74; PP. 208-218; BIBL. 14 REF.Conference Paper

A CHARACTERIZATION OF FLOYD-PROVABLE PROGRAMSANDREKA H; NEMETI I; SAIN I et al.1981; LECT. NOTES COMPUT. SCI.; ISSN 0302-9743; DEU; DA. 1981; NO 118; PP. 162-171; BIBL. 11 REF.Conference Paper

Total correctness in nonstandard logics of programsSAIN, I; ENGELER, E.Theoretical computer science. 1987, Vol 50, Num 3, pp 285-321, issn 0304-3975Article

Weak second order characterizations of various program verification systemsMAKOWSKY, J. A; SAIN, I.Theoretical computer science. 1989, Vol 66, Num 3, pp 299-321, issn 0304-3975Article